Greibach Normal Form in Algebraically Complete Semirings
نویسندگان
چکیده
We give inequational and equational axioms for semirings with a fixed-point operator and formally develop a fragment of the theory of context-free languages. In particular, we show that Greibach’s normal form theorem depends only on a few equational properties of least pre-fixed-points in semirings, and elimination of chainand deletion rules depend on their inequational properties (and the idempotency of addition). It follows that these normal form theorems also hold in non-continuous semirings having enough fixed-points.
منابع مشابه
Greibach Normal Form Transformation, Revisited
We develop a new method for placing a given context-free grammar into Greibach normal form with only polynomial increase of its size. Starting with an arbitrary "-free context-free grammar G, we transform G into an equivalent context-free grammar H in extended Greibach normal form; i.e., in addition to rules, fulllling the Greibach normal form properties, the grammar can have chain rules. The s...
متن کاملInfinite Arrays and Infinite Computations
A complete metric ttipology is introduced on the set of :il finite and infinite arrays and the topological properties of the space are studied. In this complete metric topolor,y, infinite arrays are the limits of increasing sequences of finite arrays. The n.>tion of successful infinite derivations in Generalized Context-free Kolam Array Grammars, yielding infinif e arrays, is introduced. This c...
متن کاملAn Elementary Proof of Double Greibach Normal Form
In [1,6,7] elementary proofs are given of Greibach Normal Form of context-free grammars [4]. Here we do the same for Double Greibach Normal Form, where it is required that each right-hand side of a production both starts and ends with a terminal symbol [5]. In [5], first a grammar in Greibach Normal Form is constructed, which is then transformed into Double Greibach Normal Form; both transforma...
متن کاملSeveral Aspects of Context Freeness for Hyperedge Replacement Grammars
In this paper we survey several aspects related to normal forms of hyperedge replacement grammars. Considering context free hyperedge replacement grammars we introduce, inspired by string grammars, Chomsky Normal Form and Greibach Normal Form. The algorithm of conversion is quite the same with the algorithm for string grammars. The important difference is related to the fact that hyperedge gram...
متن کاملGenerating all permutations by context-free grammars in Greibach normal form
We consider context-free grammars Gn in Greibach normal form and, particularly, in Greibach m-form (m = 1, 2) which generates the finite language Ln of all n! strings that are permutations of n different symbols (n ≥ 1). These grammars are investigated with respect to their descriptional complexity, i.e., we determine the number of nonterminal symbols and the number of production rules of Gn as...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002